The component sizes of a critical random graph with given degree sequence
نویسندگان
چکیده
منابع مشابه
The Component Sizes of a Critical Random Graph with given Degree Sequence by Adrien Joseph
Consider a critical random multigraph Gn with n vertices constructed by the configuration model such that its vertex degrees are independent random variables with the same distribution ν (criticality means that the second moment of ν is finite and equals twice its first moment). We specify the scaling limits of the ordered sequence of component sizes of Gn as n tends to infinity in different ca...
متن کاملThe Size of the Giant Component of a Random Graph with a Given Degree Sequence
Given a sequence of non negative real numbers which sum to we consider a random graph having approximately in ver tices of degree i In the authors essentially show that if P i i i then the graph a s has a giant component while if P i i i then a s all components in the graph are small In this paper we analyze the size of the giant component in the former case and the structure of the graph forme...
متن کاملCover time of a random graph with given degree sequence
In this paper we establish the cover time of a random graph G(d) chosen uniformly at random from the set of graphs with vertex set [n] and degree sequence d. We show that under certain restrictions on d, the cover time of G(d) is whp asymptotic to d−1 d−2 θ dn log n. Here θ is the average degree and d is the effective minimum degree.
متن کاملRandom graphs with a given degree sequence
Large graphs are sometimes studied through their degree sequences (power law or regular graphs). We study graphs that are uniformly chosen with a given degree sequence. Under mild conditions, it is shown that sequences of such graphs have graph limits in the sense of Lovász and Szegedy with identifiable limits. This allows simple determination of other features such as the number of triangles. ...
متن کاملThe number of graphs and a random graph with a given degree sequence
We consider the set of all graphs on n labeled vertices with prescribed degrees D = (d1, . . . , dn). For a wide class of tame degree sequences D we prove a computationally efficient asymptotic formula approximating the number of graphs within a relative error which approaches 0 as n grows. As a corollary, we prove that the structure of a random graph with a given tame degree sequence D is well...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Annals of Applied Probability
سال: 2014
ISSN: 1050-5164
DOI: 10.1214/13-aap985